时延数字控制系统最优控制问题的离散正交多项式解法

本文利用一般的离散正交多项式研究了具有2s个时延项离散系统的最优控制问题。文中导出了系统状态和控制向量离散正交级数展开式中系数向量间的关系,然后,将离散动态系统的最优控制问题转化为直接对二次型性能指标中一组系数向量的参数优化问题,并由一组线性代数方程给出了这组最优系数向量的解。最后,还介绍了一个数值例子。     

维和警察防暴队迎战原则探析

维和警察防暴队在海地任务区遇到很多实际问题。在执勤执法中灵活运用迎战原则,探讨维和警察防暴队迎战原则的法律依据、行动授权和执行程序,总结在任务区复杂多变的情况下维和警察防暴队如何依托国际法规,合理运用迎战原则,有效使用武力授权,合法利用武器装备,严格遵守执行程序的措施和方法,对于完成维和任务具有一定的指导作用。     

The incentive effect of acceptance sampling plans in a supply chain with endogenous product quality

This article studies a firm that procures a product from a supplier. The quality of each product unit is measured by a continuous variable that follows a normal distribution and is correlated within a batch. The firm conducts an inspection and pays the supplier only if the product batch passes the inspection. The inspection not only serves the purpose of preventing a bad batch from reaching customers but also offers the supplier an incentive to improve product quality. The firm determines the acceptance sampling plan, and the supplier determines the quality effort level in either a simultaneous game or a Stackelberg leadership game, in which both parties share inspection cost and recall loss caused by low product quality. In the simultaneous game, we identify the Nash equilibrium form, provide sufficient conditions that guarantee the existence of a pure strategy Nash equilibrium, and find parameter settings under which the decentralized and centralized supply chains achieve the same outcome. By numerical experiments, we show that the firm's acceptance sampling plan and the supplier's quality effort level are sensitive to both the recall loss sharing ratio and the game format (i.e., the precommitment assumption of the inspection policy). © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

线性规划优化分析的元模型方法及其比较

线性规划优化分析在经济管理等领域有着广泛的应用。当线性规划约束条件的右端向量在一定范围内变化时,目标函数的最优值是右端向量的一个复杂的分片线性函数,但通常难以给出分析表达式。应用多项式回归、径向基函数、Kriging法及多项式回归 Kriging法这四种元模型方法,能快速预测最优值函数。通过仿真实验,对这四种形式的元模型作较全面的比较分析。数值实验的结果表明,用次数较少的实验设计,后三种方法都具有较高的拟合精度;特别地,多项式回归 Kriging法不仅拟合精度高,而且还能用一个二阶多项式给出最优值函数的一个简明的近似描述。结果表明,元模型方法是研究线性规划优化分析问题的有效途径。     

基于分组重量编码的蛋白质同源寡聚体分类研究

基于一种新的特征提取方法——分组重量编码(Encoding on the basis of Grouped Weight,简记为EBGW),采用组分耦合算法作为分类器,从蛋白质一级序列出发对四类同源寡聚体蛋白进行分类研究。结果表明,在Jackknife检验下,基于分组重量编码的分类方法总体分类精度达到70.92%,比基于氨基酸组成和加权伪氨基酸成分特征提取方法分别提高20.28和7.53个百分点,说明分组重量编码对于蛋白质同源寡聚体分类是一种高效的特征提取方法。     

混合气体识别的响应等效性与瞬态信号正交分解模型

针对目前混合气体识别大多采用传感器稳态响应信号、基于线性混合假设或大量样本学习,而瞬态响应信号特征分析主要应用非正交分解的问题,提出一种基于响应等效性与瞬态信号正交分解的混合气体识别模型。分析金属氧化物半导体传感器对混合气体的响应特性,建立基于气体响应成分等效性假设的气体非线性混合模型,在此基础上,提出并应用一种新的正交基函数——扩展类Legendre正交基,对气体传感器瞬态响应信号进行分解;通过对正交分解系数与气体浓度的回归分析,验证二者之间的指数型关联关系,并以正交分解系数为特征参数,利用气体非线性等效混合模型对混合气体分解与辨识。实验结果表明,尽管这种混合气体识别模型仅用单一气体检测的先验知识,对混合气体的识别误差仍可达到15%以内。     

基于正交试验法的冗余捷联惯组故障诊断实验方法研究

冗余捷联惯组是运载火箭控制系统的重要设备,需要对其进行故障检测和隔离以保证系统正常工作,所应用的故障检测算法需要进行有效性评估。由于惯组器件配置和故障形式的多样性,所有故障情形进行逐一测试不可能的,因此提出利用正交试验法安排实验,对广义似然比故障检测算法进行性能检测。试验结果表明应用正交试验实现了故障情形的良好覆盖性,有效减少了试验次数,并且从测试数据中验证了故障检测算法的有效性。     

基于合成沸石的Cr~(3+)深度吸附处理

以吸附后溶液中Cr3+质量浓度低于国家相关标准为目的,采用搅拌动态吸附的方法,研究投加量、吸附时间、吸附温度、pH值对吸附的影响,考察沸石粉对Cr3+深度吸附的条件。实验发现,在沸石粉投加量为1g/L的前提下,吸附时间为2h、温度为55℃、pH值为4~5时分别达到较好吸附效果。开展三因素三水平正交试验,得到深度吸附条件为:投加量1g/L、吸附时间2h、吸附温度35℃、pH=5,此时去除率达到99.7%。对深度吸附条件进行验证,发现在此条件下可以将Cr3+溶液的质量浓度由0.1mg/L降低至0.03mg/L;最后通过实验得出沸石粉对Cr3+的饱和吸附量为79.93mg/g。     

比例最小偏度单形UKF的RBF神经网络算法

为提高RBF神经网络的建模性能,提出一种基于改进无迹Kalman滤波(UKF)的RBF神经网络训练算法。在该算法中,首先将比例最小偏度单形Sigma点采样策略引入UT,以有效改进UKF,提升其计算效率,然后利用改进的UKF优化估计RBF神经网络的最优参数。仿真结果表明,改进的UKF比EKF具有更高的RBF神经网络模型训练精度,与传统UKF的模型精度大体相当,但速度更快,计算效率更高。     

Multidirectional scheduling scheme in resource‐constrained project schedulingproblem

In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single‐directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357–373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so‐called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state‐of‐the‐art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44–55, 2014